The minimal dimensions of faithful representations for Heisenberg Lie superalgebras

This paper aims to determine the minimal dimensions and super-dimensions of faithful representations for Heisenberg Lie superalgebras over an algebraically closed field of characteristic zero.     

The effect of a market factor on information flow between stocks using the minimal spanning tree

We empirically investigated the effects of market factors on the information flow created from N(N−1)/2 linkage relationships among stocks. We also examined the possibility of employing the minimal spanning tree (MST) method, which is capable of reducing the number of links to N−1. We determined that market factors carry important information value regarding information flow among stocks. Moreover, the information flow among stocks showed time-varying properties according to the changes in market status. In particular, we noted that the information flow increased dramatically during periods of market crises. Finally, we confirmed, via the MST method, that the information flow among stocks could be assessed effectively with the reduced linkage relationships among all links among stocks from the perspective of the overall market.     

Fuzzy半群中的极小Fuzzy理想

本文先给出Ｆｕｚｙ半群中极小Ｆｕｚｙ理想的一些代数性质,进而利用极小Ｆｕｚｙ理想刻划Ｆｕｚｚｙ单半群的一些代数性质     

Infimum Properties Differ in the Weak Truth-table Degrees and the Turing Degrees

Abstract We prove that there are non-recursive r.e. sets A and C with A < _T C such that for every set . Both authors are supported by “863” and the National Science Foundation of China     

Chern-Osserman inequality for minimal surfaces in H

We obtain Chern-Osserman's inequality of a complete properly immersed minimal surface in hyperbolic -space, provided the -norm of the second fundamental form of the surface is finite.

     

一种可压缩流动的高阶加权紧致非线性格式(WCNS)的加速收敛方法

以高超声速粘性绕流的数值模拟为例,研究LU-SGS、高斯-赛德尔点松弛、线松弛以及GMRES等隐式求解方法在空间项采用高阶精度格式WCNS离散时的收敛性,并对GMRES(generalized minimal residual)方法中的子迭代影响作了对比计算.结果表明,采用准确的解析雅克比矩阵的点、线松弛的收敛速度优于LU-SGS,以线松弛为预处理的GMRES算法具有良好的收敛特性.     

Syndetically proximal pairs

For continuous self-maps of compact metric spaces, we study the syndetically proximal relation, and in particular we identify certain sufficient conditions for the syndetically proximal cell of each point to be small. We show that any interval map f with positive topological entropy has a syndetically scrambled Cantor set, and an uncountable syndetically scrambled set invariant under some power of f. In the process of proving this, we improve a classical result about interval maps and establish that if f is an interval map with positive topological entropy and m?2, then there is n∈N such that the one-sided full shift on m symbols is topologically conjugate to a subsystem of fn² (the classical result gives only semi-conjugacy).     

A maintenance model with failures and inspection following Markovian arrival processes and two repair modes

We consider a deteriorating system submitted to external and internal failures, whose deterioration level is known by means of inspections. There are two types of repairs: minimal and perfect, depending on the deterioration level, each one following a different phase-type distribution. The failures and the inspections follow different Markovian arrival processes (MAP). Under these assumptions, the system is governed by a generalized Markov process, whose state space and generator are constructed. This general model includes the phase-type renewal process as a special case. The distribution of the number of minimal and perfect repairs between two inspections are determined. A numerical application optimizing costs is performed, and different particular cases of the model are compared.     

Numerical analysis for factorial data analysis. Part II: Special purpose hardware—the programmable systolic array SARDA

The second part of this paper deals with the systolic implementation of the computational kernel for factorial data analysis, defined in Part I, on special-purpose hardware. The framework of the study is that a sequence of different algorithms has to be performed on a unique hardware array. This fact has led us to the design of the programmable systolic array SARDA: this is a triangular array which consists of programmable nodes with local memory and programmable orthogonal connections.